An Improvement of LUC2 Cryptosystem Algorithm Using Doubling with Remainder
نویسندگان
چکیده
The major factor that influences the performance of the LUC public-key cryptosystem is the computation of Ve and Vd, a public and private key, respectively. Its involve a huge steps of computations for large values of e and d. We concentrated our discussion on how to utilize and manipulate the doubling step technique for an efficient LUC2 computation. Therefore, we proposed the so-called Doubling with Remainder technique. It shows a better performance in LUC2 computations and also a great reductions of time consume for computations. The experimental results for sequential, doubling steps and doubling with remainder are also included.
منابع مشابه
Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملSpecial Hyperelliptic Curve Cryptosystems of Genus Two: Efficient Arithmetic and Fast Implementation
There exists a manifold variety of cryptographic applications: from low level embedded crypto implementations up to high end cryptographic engines for servers. The latter require a flexible implementation of a variety of cryptographic primitives in order to be capable of communicating with several clients. On the other hand, on the client it only requires an implementation of one specific algor...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملA Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus Two
We deal with a divisor class halving algorithm on hyperelliptic curve cryptosystems (HECC), which can be used for scalar multiplication, instead of a doubling algorithm. It is not obvious how to construct a halving algorithm, due to the complicated addition formula of hyperelliptic curves. In this paper, we propose the first halving algorithm used for HECC of genus 2, which is as efficient as t...
متن کاملSecurity of the Cao-Li Public Key Cryptosystem
We show that the Cao-Li cryptosystem proposed in [1] is not secure. Its private key can be reconstructed from its public key using elementary means such as LU-decomposition and Euclidean algorithm. The Cao-Li public key cryptosystem was first proposed in [1]. It encrypts messages using a bilinear form that is chosen to permit easy decryption by the Chinese remainder theorem. Public key cryptosy...
متن کامل